Satellite proximate interception vector guidance based on differential games

This paper studies the proximate satellite interception guidance strategies where both the interceptor and target can perform orbital maneuvers with magnitude limited thrusts. This problem is regarded as a pursuit-evasion game since satellites in both sides will try their best to capture or escape. In this game, the distance of these two players is small enough so that the highly nonlinear earth-centered gravitational dynamics can be reduced to the linear Clohessy-Wiltshire (CW) equations. The system is then simplified by introducing the zero effort miss variables. Saddle solution is formulated for the pursuit-evasion game and time-to-go is estimated similarly as that for the exo-atmospheric interception. Then a vector guidance is derived to ensure that the interception can be achieved in the optimal time. The proposed guidance law is validated by numerical simulations.     

Reliability-based trajectory optimization using nonintrusive polynomial chaos for Mars entry mission

This paper presents the reliability-based sequential optimization (RBSO) method to settle the trajectory optimization problem with parametric uncertainties in entry dynamics for Mars entry mission. First, the deterministic entry trajectory optimization model is reviewed, and then the reliability-based optimization model is formulated. In addition, the modified sequential optimization method, in which the nonintrusive polynomial chaos expansion (PCE) method and the most probable point (MPP) searching method are employed, is proposed to solve the reliability-based optimization problem efficiently. The nonintrusive PCE method contributes to the transformation between the stochastic optimization (SO) and the deterministic optimization (DO) and to the approximation of trajectory solution efficiently. The MPP method, which is used for assessing the reliability of constraints satisfaction only up to the necessary level, is employed to further improve the computational efficiency. The cycle including SO, reliability assessment and constraints update is repeated in the RBSO until the reliability requirements of constraints satisfaction are satisfied. Finally, the RBSO is compared with the traditional DO and the traditional sequential optimization based on Monte Carlo (MC) simulation in a specific Mars entry mission to demonstrate the effectiveness and the efficiency of the proposed method.     

基于长方体禁飞区的安全绕飞轨迹设计

摘要： 以C W方程为基础针对圆轨道近距离双脉冲绕飞问题,研究基于长方体禁飞区的安全绕飞轨迹设计方法.针对双脉冲绕飞动力学模型中的变量进行代数变换,在此基础上对变量间的关系进行推导,证明部分变量在特定区间范围内具有单调性的定理;给出保证绕飞轨迹安全的约束条件,进而结合推导出的定理和安全约束条件得到轨道面内全方位安全绕飞轨迹的一般性设计方法.通过针对以目标器正后方为绕飞起点的两种典型绕飞以及到任意方位的绕飞进行仿真,验证方法的有效性.     

风洞侧壁干扰对机翼表面霜冰的影响

采用数值模拟的方法研究了不同阻塞度下侧壁干扰对NACA0012翼型表面霜冰生长的影响。通过对流场和水滴撞击特性的研究发现:侧壁干扰会压缩来流空气,致使更多水滴跟随气流向机翼前缘汇集,增大了翼面水滴收集系数,且翼面水滴总收集量与阻塞度成正比、与液滴雷诺数成反比;同时会改变水滴的撞击方向,使水滴撞击极限和最大水收集系数的位置发生偏移。采用多步法对结冰特性的研究发现:在基准计算工况下,当阻塞度为20%时,侧壁干扰效应带来结冰量的相对附加增量约为16%;在同一阻塞度下,各时间步长内的结冰相对附加增量基本相等。提出了一种表征侧壁干扰对水滴收集影响强弱的因子,该影响因子与水滴收集相对附加增量具有较高的线性关系。      

冲压发动机导弹爬升段和巡航段轨迹优化

为了研究冲压发动机导弹爬升段和高空巡航段的燃油最优弹道,提高射程,提出了较为通用的一体化优化设计方法。研究了冲压发动机、导弹气动力与弹道之间的耦合特性,建立了导弹动力学模型,将弹道的最优控制问题转化为参数优化问题。为求解该参数优化问题,针对传统粒子群(PSO)算法求解优化问题时存在的早熟收敛的不足,提出了一种算法结构,改善粒子群算法的性能,求其最优解。数值结果表明:改进的算法相对其他几种粒子群算法具备更优秀的性能。所优化弹道相比导弹试验数据,以飞行时间增加3.3%为代价,节约了4.46%燃油。多组高弹道的仿真结果表明,巡航高度应不超过动压边界前提下,高弹道巡航有利于节约燃油,增加导弹射程。     

基于混合优化的运载器大气层内上升段轨迹快速规划方法

针对运载器大气层内的最优轨迹快速规划问题,提出一种将求解最优控制问题的间接法与直接法相结合的混合优化方法。首先,基于最优控制问题的一阶必要条件,将运载器大气层内的三维最优上升问题转化为Hamiltonian两点边值问题;然后,采用直接法中能以较少的节点获得较高求解精度的Gauss伪谱法进行求解,提高算法的求解效率;最后,采用真空解析解初值及密度同伦技术,解决初值猜测与算法收敛困难的问题。仿真结果表明,混合优化算法能够准确、快速地对运载器大气层内的最优上升轨迹问题进行求解,并在计算精度与效率上均优于间接法,可应用于运载器的轨迹在线规划与闭环制导。     

基于NFTET的高超声速飞行器再入容错制导

针对以X-33为对象的三自由度高超声速飞行器,采用相邻可行轨迹存在定理(NFTET)设计了容错制导律以解决再入段执行器发生故障的轨迹重构问题。在标称情况下采用预测校正算法生成满足再入过程约束和终端约束要求的再入轨迹;当执行器发生故障时,飞行器气动参数、结构和舵面力矩都可能发生不可预测的变化,原先的轨迹不再满足制导要求,因此需要设计新型容错制导律。针对实际再入制导模型,基于NFTET设计容错制导算法对轨迹进行重构,得到满足故障情况下制导任务的可行轨迹。从仿真结果中可以看出,容错制导算法生成的新轨迹重新回到了约束范围之内,轨迹呈收敛趋势,使得高超声速飞行器从故障恢复到正常飞行状态,提高了飞行器的自主容错能力。     

基于混合粒子群算法的上升段交会弹道快速优化设计

基于梯度搜索的高效性和粒子群搜索的随机性,提出了一种混合粒子群算法,并应用该算法研究了运载火箭上升段交会弹道快速优化设计问题.以运载火箭与目标飞行器在交会时刻的距离最小为目标函数,设计了运载火箭飞行程序,建立了运载火箭上升段交会弹道优化模型,同时分别采用混合粒子群算法、遗传算法和粒子群算法进行求解.仿真结果表明:基于本文算法对运载火箭上升段交会弹道进行优化设计,平均交会位置误差为4.137m,较遗传算法减少了17.940m,平均优化耗时488.922s,较粒子群算法缩短了2342.125s.混合粒子群算法搜索速度较快,收敛精度较高,可用于运载火箭上升段交会弹道的快速优化设计.